منابع مشابه
The Minimum Distance Energy for Polygonal Unknots
This paper investigates the energy UMD of polygonal unknots. It provides equations for finding the energy for any planar regular n-gon and for any m-gon, where the vertices lie on the vertices of a regular m 2 -gon and on the midpoints of each edge. In addition, we show that a regular 4-gon minimizes the energy for any quadrilateral. Finally, this paper includes a proof showing that if we have ...
متن کاملMinimum Opaque Covers for Polygonal Regions
The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity, the problem remains remarkably intractable. The aim of this paper is to establish a framework and fundamental results for minimum opaque covers where S is a...
متن کاملPolynomial Minimum Root Separation
The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances between distinct (real or complex) roots of P. Some asymptotically good lower bounds for the root separation of P are given, where P may have multiple zeros. There are applications in the analysis of complexity of algorithms and in the theory of algebraic and transcendental numbers.
متن کاملMinimum Distance Queries For Polygonal And Parametric Models
Calculation of the minimum distance to a geometric object or the minimum separation between objects is a fundamental problem that has application in a variety of arenas. Minimum separation queries for sculptured surfaces are believed particularly difficult, yet are increasingly important as modeling problems grow larger and interactivity demands grow more stringent. We present a set of algorith...
متن کاملOn Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on n ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1988
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90049-1